Search results for "Arithmetic of abelian varieties"
showing 3 items of 3 documents
Abelian gradings on upper-triangular matrices
2003
Let G be an arbitrary finite abelian group. We describe all possible G-gradings on an upper-triangular matrix algebra over an algebraically closed field of characteristic zero.
Hybrid bases for varieties of semigroups
2003
We consider the lower part of the lattice of varieties of semigroups. We present finite bases of hybrid identities for the varieties of normal bands, commutative bands and abelian groups of finite exponent. The variety A n,0 of abelian groups provides an example of a variety which has no finite base of hyperidentities (cf. [12]) but has a finite base of hybrid identities.
Algorithms for Computing Abelian Periods of Words
2012
Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\sigma$ can have $\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \times \sigma)$ using $O(n \times \sigma)$ space. We present an off-line algorithm based on a $\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the Abelian periods of all the prefixes of $w$.